Matching algorithms
نویسندگان
چکیده
منابع مشابه
Parallel String Matching Algorithms
String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.
متن کاملAlgorithms for Weighted Matching
We consider the matching of weighted patterns against an unweighted text. We adapt the shift-add algorithm for this problem. We also present an algorithm that enumerates all strings that produce a score higher than a given score threshold when aligned against a weighted pattern and then searches for all these strings using a standard exact multipattern algorithm. We show that both of these appr...
متن کاملLinear Pattern Matching Algorithms
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algorithm "for obtaining a compacted version of a bi-tree associated with a given string is pr...
متن کاملCombination of Matching Algorithms
This paper addresses the problem of systematically building a matching algorithm for the union of two disjoint equational theories. The question is under which conditions matching algorithms in the single theories are suucient to obtain a matching algorithm in the combination? In general, the blind use of combination techniques introduces uniication. Two diierent restrictions are considered in ...
متن کاملAlgebraic Algorithms for Matching
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This problem is known as the graph matching problem, and its study has had an enormous impact on the develpoment of algorithms, combinatorics, optimization theory, and even complexity theory. Mathematicians have been interested in the matching problem since the 19th century, leading to celebrated theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1969
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(69)80101-8